基于级联PPMgLN晶体的双倍/三倍频双波长激光器

本文演示了紧凑的绿色和近红外双色连续波激光光源,其发射波长分别为516 nm和775 nm。设计并制造了级联的周期性极化掺镁铌酸锂晶体,用于同时转换通信波长的二次谐波(SHG)和三次谐波(THG),可以在相同温度下获得绿色和近红外激光的输出。通过建立一个单程激光测量系统,在2 W泵浦功率下获得516 nm的0.15 mW绿光和775 nm的1.19 mW的光,晶体温度控制在30.8 ℃。实验结果将为单激光器泵浦的紧凑型双波长共线激光器提供重要的案例。     

Nonsensitiveness Regions for Threshold Ellipsoids

The problem is to determine nonsensitiveness regions for threshold ellipsoids within a regular mixed linear model.     

颜色视觉匹配中明度阈值的评价

为了对颜色视觉匹配中的明度阈值特性进行评价,采用在阴极射线管显示器上获得的颜色刺激,在5个不同明度的中性色背景下,标准刺激的明度L*从5到95以5个CIELAB单位为变化步长,共对19个不同明度的中性标准颜色进行视觉匹配实验。通过对实验结果的处理和分析,验证了关于颜色刺激视觉辨别明度阈值与背景明度之间相关性的韦伯法则和crispening效应,同时利用颜色视觉匹配数据对基于CIELAB的相关色差公式进行了评价和比较,CIEDE2000具有最好的明度差预测性能,CMC次之,CIELAB和CIE94最差。     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

Fold‐2‐covering triangular embeddings

For a graph G and a positive integer m, G_(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m² edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G_(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G_(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G₍₂₎ does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G₍₂₎ does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003     

GLOBAL ATTRACTOR OF A SPATIALLY DISCRETIZED REACTION-DIFFUSION SYSTEM WITH HAMILTONIAN STRUCTURE

１ＨａｍｉｌｔｏｎｉａｎＳｔｒｕｃｔｕｒｅｉｎＲｅａｃｔｉｏｎ－ＤｉｆｕｓｉｏｎｓｙｓｔｅｍＣｏｎｓｉｄｅｒａｓｙｓｔｅｍｏｆｒｅａｃｔｉｏｎ－ｄｉｆｕｓｉｏｎｅｑｕａｔｉｏｎｓｕｔ＝ｕｘｘ＋ｆ（ｕ，ｖ）ｖｔ＝ｖｘｘ＋ｇ（ｕ，ｖ）｛（１．１）ｗｈｅｒ...     

Fractional programming and characterization of some vertices of the feasible region

This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view.     

全固态多波长飞秒脉冲激光系统

利用棱镜对引进频谱空间啁啾来补偿飞秒脉冲激光二次谐波产生中的相位失配,提高了倍频效率建立了一套全固态、多波长(1065nm, 532nm,823.1nm, 402nm)飞秒脉冲激光系统自制的Nd:YVO4激光器输出532nm绿光激光,最高平均功率可达5.6W当用2.5W绿光激光泵浦时,从自制的钛宝石激光器及经BBO倍频可分别输出中心波长为823.1nm和402nm,平均功率300mW和73mW,谱宽32.3nm和5.1nm,脉宽22fs和33.3fs、重复率108MHz的近红外和蓝光激光整个系统具有结构紧凑、倍频效率高、运行稳定的特点.